A Powerful Evaluation Strategy For CLP Programs
نویسندگان
چکیده
This paper presents a new, powerful evaluation strategy (OLDTC-AM) for CLP programs. OLDTC-AM is developed by combining the OLDT evaluation strategy with a logical answer manipulation mechanism. Under the OLDTC-AM evaluation strategy, the termination characteristics of CLP programs are greatly improved and the expressive abilities of CLP languages are greatly increased. One application of this power is the direct solving of optimization problems. Through an example, we show how an optimization problem can be expressed as a CLP program simply and be solved logically in the constraint logic framework.
منابع مشابه
A Tabulation Algorithm for Clp Revised Report
Since its introduction in logic programming, tabulation has proven to a be powerful tool in many areas. The technique has been lifted to constraint extensions of Datalog and to constraint logic programming (CLP). In this abstract, we describe a new formulation of tabulation for CLP, directly designed towards an implementation on CLP systems. We illustrate the use of our algorithm by comparing t...
متن کاملMax-planck-institut F ¨ Ur Informatik Analysis of Nonlinear Constraints in Clp(r) I N F O R M a T I K Author's Address
Solving nonlinear constraints over real numbers is a complex problem. Hence constraint logic programming languages like CLP(R) or Prolog III solve only linear constraints and delay nonlinear constraints until they become linear. This efficient implementation method has the disadvantage that sometimes computed answers are unsatisfiable or infinite loops occur due to the unsatisfiability of delay...
متن کاملEffectiveness of Optimizing Compilation for CLP(R)
Constraint Logic Programming (CLP) languages extend logic programming by allowing constraints from diierent domains such as real numbers or Boolean functions. They have proved to be ideal for expressing problems that require interactive mathematical modelling and complex combinatorial optimization problems. However, CLP languages have mainly been considered as research systems, useful for rapid...
متن کاملTime and Money : A Case Study in Systematic
The utility of Constraint Logic Programming (CLP) for developing complex and exible software has been well established. However, on realizing the full power of the paradigm, programmers can nd themselves coding some remarkably complicated models, producing programs that are compact, powerful, but diicult to understand and modify. The Skeletons and Techniques discipline for developing Prolog pro...
متن کاملStrategies for the Efficient Solution of Hybrid Constraint Logic Programs
Meta-S is a system for defining the cooperation and coordination of constraint solvers to attack hybrid constraint problems. The integration of a logic programming language into this system by considering the language evaluation mechanism resolution as constraint solver yields a CLP language with support for solver cooperation. Using the strategy definition framework of Meta-S we define classic...
متن کامل